import java.util.Scanner;
import java.util.Stack;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 22652
 * Date: 2024-05-16
 * Time: 22:26
 */
public class test1 {

    public static void main(String[] args) {
        BinaryTree binaryTree=new BinaryTree();
        BinaryTree.TreeNode A=binaryTree.createTree();
//        binaryTree.postOrder(A);
//        System.out.println();
        binaryTree.inOrder(A);
//        System.out.println();
//        binaryTree.preOrder(A);
//        System.out.println();
//        System.out.println(binaryTree.size(A));
//        System.out.println(binaryTree.getLeafNodeCount(A));
//        System.out.println(binaryTree.getKLevelNodeCount(A, 3));
//        System.out.println(binaryTree.getHeight(A));
//        System.out.println(binaryTree.find(A, 'C').val);
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        System.out.println(Math.pow(2,1));
//        binaryTree.levelOrder(A);
//        System.out.println(binaryTree.isCompleteTree(A));
        Stack<BinaryTree.TreeNode> stack=new Stack<>();
        binaryTree.getPath(A,A.left.right,stack);
        System.out.println();
        binaryTree.preOrderNor(A);
        System.out.println();
        binaryTree.inOrderNor(A);
        System.out.println();
        binaryTree.postOrderNor(A);
    }
}